CLP(FD)-based Information Systems in Space Management Optimization

نویسندگان

  • Irene Rodrigues
  • Daniel Diaz
  • Salvador Abreu
چکیده

Declarative techniques such as Constraint Logic Programming (CLP) can be very effective in modeling and assisting management decisions. We present a CLP-based local search method and a tool for managing university classrooms which extends the previous design to deal with spatial resource optimization issues, along two dimensions: classroom use and occupancy rates, while still meeting student and lecturer preferences. Our method was experimentally found to reach a 30% improvement in space utilization, while preserving the quality of the timetable, both for students and lecturers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing CLP branch and bound techniques for scheduling problems

In this paper, we propose a constraint logic programming (CLP) approach to the solution of a job shop scheduling problem in the field of production planning in orthopaedic hospital departments. A pure CLP on finite domain (CLP(FD)) approach to the problem has been developed, leading to disappointing results. In fact, although CLP(FD) has been recognized as a suitable tool for solving combinator...

متن کامل

Programming with TOY(FD)

In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...

متن کامل

Labeling in CLP(FD) with Evolutionary Programming

Constraint logic programming over finite integer domains allows a declarative and flexible statement of combinatorial optimization problems. The paradigm used is "constraint and generate". Constraints prune in advance the search space, and then, a enumeration phase, also called labeling, and a search strategy are needed to find the optimal solution. In this paper we introduce the integration of...

متن کامل

Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD)

Product configuration systems are an emerging software technology that supports companies in deploying mass customization strategies. In this paper, we describe a CLP-based reasoning engine that we developed for a commercial configuration system. We first illustrate the advantages of the CLP approach to product configuration over other ones. Then, we describe the actual encoding of the consider...

متن کامل

Using Secondary Structure Information for Protein Folding in CLP(FD)

The protein folding problem is the problem of predicting the 3D structure of a protein when the linear sequence of aminoacids identifying it is known. In this paper we present a declarative implementation in Constrain & Generate style in CLP (FD) of the protein folding problem, for models based on face-centered cubes. We use information concerning secondary structure (and other heuristics) to s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017